Reachability in Tree-Like Component Systems is PSPACE-Complete
نویسندگان
چکیده
The reachability problem in component systems is PSPACEcomplete. We show here that even the reachability problem in the subclass of component systems with “tree-like” communication is PSPACEcomplete. For this purpose we reduce the question if a Quantified Boolean Formula (QBF) is true to the reachability problem in “tree-like” component systems.
منابع مشابه
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
The reachability problem in cooperating systems is known to be PSPACE-complete. We show here that this problem remains PSPACE-complete when we restrict the communication structure between the subsystems in various ways. For this purpose we introduce two basic and incomparable subclasses of cooperating systems that occur often in practice and provide respective reductions. The subclasses we cons...
متن کاملOn parametrized verification of asynchronous, shared-memory pushdown systems
We consider the model of parametrized asynchronous shared-memorypushdown systems as introduced in [Hague’11]. In a series of recentpapers it has been shown that reachability in this model is Pspace-complete [Esparza, Ganty, Majumdar’13] and that liveness is decidablein Nexptime [Durand-Gasselin, Esparza, Ganty, Majumdar’15]. Weshow that the liveness problem is Pspace-complet...
متن کاملControlled Term Rewriting
Motivated by the problem of verification of imperative tree transformation programs, we study the combination, called controlled term rewriting systems (CntTRS), of term rewriting rules with constraints selecting the possible rewrite positions. These constraints are specified, for each rewrite rule, by a selection automaton which defines a set of positions in a term based on tree automata compu...
متن کاملReachability in Resource-Bounded Reaction Systems
Reaction systems, a formalism describing biochemical reactions in terms of sets of reactants, inhibitors, and products, are known to have a PSPACE-complete configuration reachability problem. We show that the complexity of the problem remains unchanged even for some classes of resource-bounded reaction systems, where we disallow either inhibitors or reactants. We also prove that the complexity ...
متن کاملReachability in Two-Clock Timed Automata Is PSPACE-Complete
A recent result has shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded onecounter automata [6]. We show that reachability in bounded one-counter automata is PSPACE-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 263 شماره
صفحات -
تاریخ انتشار 2010